#include<queue>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int x,n=10;
	priority_queue<int,vector<int>,greater<int>> a;
	for(int i=1;i<=n;i++)
	{
		cin>>x;
		a.push(x);
	}
	while(!a.empty())
	{
		cout<<a.top()<<" ";
		a.pop();
	}
    return 0;
}
